Rss-based Affinity Propagation Algorithm Accuracy Improvement Considering Physical Location
نویسندگان
چکیده
منابع مشابه
improvement of Location-based Algorithm in the Internet of Things
Location Based Services (LBS) has become an important field of research with the rapid development of Internet-based Information Technology (IOT) technology and everywhere we use smartphones and social networks in our everyday lives. Although users can enjoy the flexibility, facility, facility and location-based services (LBS) with the Internet of Things, they may lose their privacy. An untrust...
متن کاملImprovements of Indoor Fingerprint Location Algorithm based on RSS
With the development of the Internet, the technology of location fingerprint is widely used because of the advantage in indoor positioning performance of complex environment. K neighbor algorithm based on signal strength is a common position fingerprint matching algorithm. This paper firstly introduces the KNN fingerprint localization algorithm, and points out the deficiency of the algorithm. T...
متن کاملFast Algorithm for Affinity Propagation
Affinity Propagation is a state-of-the-art clustering method recently proposed by Frey and Dueck. It has been successfully applied to broad areas of computer science research because it has much better clustering performance than traditional clustering methods such as k-means. In order to obtain high quality sets of clusters, the original Affinity Propagation algorithm iteratively exchanges rea...
متن کاملClustering Large-Scale Data Based On Modified Affinity Propagation Algorithm
Traditional clustering algorithms are no longer suitable for use in data mining applications that make use of large-scale data. There have been many large-scale data clustering algorithms proposed in recent years, but most of them do not achieve clustering with high quality. Despite that Affinity Propagation (AP) is effective and accurate in normal data clustering, but it is not effective for l...
متن کاملAn Affinity Propagation-Based DNA Motif Discovery Algorithm
The planted (l, d) motif search (PMS) is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs) in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challenging tasks for motif discovery. To solve the tasks, we propose a new algorithm, APMotif, which f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2013
ISSN: 1812-5638
DOI: 10.3923/itj.2013.4544.4548